Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
نویسندگان
چکیده
منابع مشابه
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
Exact computer arithmetic has a variety of uses including, but not limited to, the robust implementation of geometric algorithms. This report has three purposes. The first is to offer fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values. The second is to propose a technique for adaptive-precision arithmetic that can often speed these ...
متن کاملPrecision Arithmetic: A New Floating-Point Arithmetic
A new deterministic floating-point arithmetic called precision arithmetic is developed to track precision for arithmetic calculations. It uses a novel rounding scheme to avoid the excessive rounding error propagation of conventional floating-point arithmetic. Unlike interval arithmetic, its uncertainty tracking is based on statistics and the central limit theorem, with a much tighter bounding r...
متن کاملDouble precision floating-point arithmetic on FPGAs
We present low cost FPGA floating-point arithmetic circuits for all the common operations, i.e. addition/subtraction, multiplication, division and square root. Such circuits can be extremely useful in the FPGA implementation of complex systems that benefit from the reprogrammability and parallelism of the FPGA device but also require a general purpose arithmetic unit. While previous work has co...
متن کاملAlgorithms for arbitrary precision floating point arithmetic
We present techniques which may be used to perform computations of very high accuracy using only straightforward oating point arithmetic operations of limited precision, and we prove the validity of these techniques under very general hypotheses satissed by most implementations of oating point arithmetic. To illustrate the application of these techniques, we present an algorithm which computes ...
متن کاملAdaptive Precision Floating Point LLL
The LLL algorithm is one of the most studied lattice basis reduction algorithms in the literature. Among all of its variants, the floating point version, also known as L, is the most popular one, due to its efficiency and its practicality. In its classic setting, the floating point precision is a fixed value, determined by the dimension of the input basis at the initiation of the algorithm. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1997
ISSN: 0179-5376
DOI: 10.1007/pl00009321